GRMIN: A Heuristic Simpli cation Algorithm for Generalized Reed-Muller Expressions
نویسندگان
چکیده
| A generalized Reed-Muller expression (GRM) is a type of AND-EXOR expressions. In a GRM, each variable may appear both complemented and uncomplemented. Networks realized using GRMs are easily tested. This paper presents GRMIN, a heuristic simpli cation algorithm for GRMs of multiple-output functions. GRMIN uses eight rules. As the primary objective, it reduces the number of products, and as the secondary objective, it reduces the number of literals. Experimental results show that, in most cases, GRMs require fewer products than conventional sum-of-products expressions (SOPs). GRMIN outperforms existing algorithms.
منابع مشابه
A Genetic Algorithm for Minimization of Fixed Polarity Reed-muller Expressions
A Genetic Algorithm (GA) is developed to nd small or minimal Fixed Polarity Reed-Muller expressions (FPRMs) for large functions. We combine the GA with greedy heuristics, i.e. we use Hybrid GAs (HGAs). We show by experiments that results superior to all other approaches for large functions can be obtained using GAs.
متن کاملDouble Fixed-Polarity Reed-Muller Expressions: A New Class of AND-EXOR Expressions for Compact and Testable Realization
As classes of AND-EXOR expressions, PPRMs, FPRMs, and ESOPs are well-known. In this paper, a new class of AND-EXOR expressions, Double Fixed-Polarity Reed-Muller Expressions (DFPRMs), is proposed. DFPRMs are generalized expressions of FPRMs, and can be the smallest PLA among all the classes of AND-EXOR expressions. We discuss their properties: the relation to other classes, a compact realizatio...
متن کاملCanonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for th - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
The concept of canonical restricted mixed polarity (CRMP) exclusive-OR sum of products forms is introduced. The CRMP forms include the inconsistent canonical Reed-Muller forms and the fixed-polarity Reed-Muller (FPRM) forms as special cases. The set of CRMP forms is included in the set of exclusive-OR sum-of-product (ESOP) expressions. An attempt to characterise minimal CRMP forms for completel...
متن کاملExact Minimization of Fixed Polarity Reed-Muller Expressions for Incompletely Speci ed Functions
This paper presents an exact minimization algorithm for fixed polarity Reed-Muller expressions (FPRMs) for incompletely specified functions. For an n-variable function with unspecified minterms there are 2 distinct FPRMs. A minimum FPRM is one with the fewest products. The minimization algorithm is based on the multi-terminal binary decision diagrams. Experimental results for a set of functions...
متن کاملEasily Testable Realizations for Generalized Reed-Muller Expressions
This paper presents a design method of easily testable AND-EXOR networks. It is an improvement of Reddy and SalujaReddy’s methods, and has the following features: 1) The network uses generalized Reed-Muller expressions (GRMs) instead of Positive Polarity Reed-Muller expressions (PPRMs). The average number of products for GRMs is less than half of that for PPRMs, and is less than that of sum-of-...
متن کامل